0.11/0.15 % Problem : Vampire---4.8_5541 : TPTP v0.0.0. Released v0.0.0. 0.11/0.16 % Command : run_E %s %d THM 0.15/0.37 % Computer : n006.cluster.edu 0.15/0.37 % Model : x86_64 x86_64 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.37 % Memory : 8042.1875MB 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.37 % CPULimit : 1440 0.15/0.37 % WCLimit : 180 0.15/0.37 % DateTime : Mon Jul 3 13:00:21 EDT 2023 0.15/0.37 % CPUTime : 0.22/0.54 Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541 0.22/0.54 # Version: 3.1pre001-ho 0.55/0.62 # Preprocessing class: HSLMSMSSLLLCHSA. 0.55/0.62 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.55/0.62 # Starting lpo1_fix with 540s (3) cores 0.55/0.62 # Starting full_lambda_9 with 180s (1) cores 0.55/0.62 # Starting almost_fo_4 with 180s (1) cores 0.55/0.62 # Starting new_ho_9 with 180s (1) cores 0.55/0.62 # Starting pre_casc_4 with 180s (1) cores 0.55/0.62 # Starting ho_unfolding_6 with 180s (1) cores 0.55/0.62 # lpo1_fix with pid 5720 completed with status 0 0.55/0.62 # Result found by lpo1_fix 0.55/0.62 # Preprocessing class: HSLMSMSSLLLCHSA. 0.55/0.62 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.55/0.62 # Starting lpo1_fix with 540s (3) cores 0.55/0.62 # No SInE strategy applied 0.55/0.62 # Search class: HGHSM-FSLM32-MHSMMSBN 0.55/0.62 # Scheduled 11 strats onto 3 cores with 540 seconds (540 total) 0.55/0.62 # Starting full_lambda_5 with 50s (1) cores 0.55/0.62 # Starting new_ho_6 with 50s (1) cores 0.55/0.62 # Starting pre_casc_4 with 50s (1) cores 0.55/0.62 # new_ho_6 with pid 5731 completed with status 0 0.55/0.62 # Result found by new_ho_6 0.55/0.62 # Preprocessing class: HSLMSMSSLLLCHSA. 0.55/0.62 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.55/0.62 # Starting lpo1_fix with 540s (3) cores 0.55/0.62 # No SInE strategy applied 0.55/0.62 # Search class: HGHSM-FSLM32-MHSMMSBN 0.55/0.62 # Scheduled 11 strats onto 3 cores with 540 seconds (540 total) 0.55/0.62 # Starting full_lambda_5 with 50s (1) cores 0.55/0.62 # Starting new_ho_6 with 50s (1) cores 0.55/0.62 # Preprocessing time : 0.010 s 0.55/0.62 0.55/0.62 # Proof found! 0.55/0.62 # SZS status Theorem 0.55/0.62 # SZS output start CNFRefutation 0.55/0.62 thf(decl_22, type, is_of: $i > ($i > $o) > $o). 0.55/0.62 thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o). 0.55/0.62 thf(decl_25, type, in: $i > $i > $o). 0.55/0.62 thf(decl_47, type, ordsucc: $i > $i). 0.55/0.62 thf(decl_61, type, imp: $o > $o > $o). 0.55/0.62 thf(decl_62, type, d_not: $o > $o). 0.55/0.62 thf(decl_71, type, non: $i > ($i > $o) > $i > $o). 0.55/0.62 thf(decl_72, type, l_some: $i > ($i > $o) > $o). 0.55/0.62 thf(decl_77, type, e_is: $i > $i > $i > $o). 0.55/0.62 thf(decl_123, type, nat: $i). 0.55/0.62 thf(decl_124, type, n_is: $i > $i > $o). 0.55/0.62 thf(decl_127, type, n_some: ($i > $o) > $o). 0.55/0.62 thf(decl_130, type, n_1: $i). 0.55/0.62 thf(decl_142, type, n_pl: $i > $i > $i). 0.55/0.62 thf(decl_147, type, diffprop: $i > $i > $i > $o). 0.55/0.62 thf(decl_148, type, d_29_ii: $i > $i > $o). 0.55/0.62 thf(decl_213, type, esk53_0: $i). 0.55/0.62 thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_d_not)). 0.55/0.62 thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_imp)). 0.55/0.62 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_all_of)). 0.55/0.62 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_is_of)). 0.55/0.62 thf(def_non, axiom, ((non)=(^[X1:$i, X2:$i > $o, X4:$i]:((d_not @ ((X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_non)). 0.55/0.62 thf(def_l_some, axiom, ((l_some)=(^[X1:$i, X2:$i > $o]:((d_not @ ((all_of @ (^[X4:$i]:((in @ X4 @ X1))) @ (non @ X1 @ X2))))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_l_some)). 0.55/0.62 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_e_is)). 0.55/0.62 thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_diffprop)). 0.55/0.62 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_n_is)). 0.55/0.62 thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_d_29_ii)). 0.55/0.62 thf(def_n_some, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X439:$i]:(((((in @ X439 @ nat)))=>((((((Z0 @ X439)))=>(~($true))))))))))=>(~($true))))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', def_n_some)). 0.55/0.62 thf(satz18b, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((d_29_ii @ (ordsucc @ X1) @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', satz18b)). 0.55/0.62 thf(satz4e, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ (ordsucc @ X1) @ (n_pl @ X1 @ n_1))))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', satz4e)). 0.55/0.62 thf(n_1_p, axiom, (is_of @ n_1 @ (^[X1:$i]:((in @ X1 @ nat)))), file('/export/starexec/sandbox2/tmp/tmp.nyKEo7TMRH/Vampire---4.8_5541', n_1_p)). 0.55/0.62 thf(c_0_14, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])). 0.55/0.62 thf(c_0_15, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])). 0.55/0.62 thf(c_0_16, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.55/0.62 thf(c_0_17, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.55/0.62 thf(c_0_18, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_non])). 0.55/0.62 thf(c_0_19, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])). 0.55/0.62 thf(c_0_20, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X412:$i]:(((((in @ X412 @ Z0)))=>((((((Z1 @ X412)))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_l_some])). 0.55/0.62 thf(c_0_21, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_16, c_0_17])). 0.55/0.62 thf(c_0_22, plain, ((non)=(^[Z0/* 19 */:$i, Z1:$i > $o, Z2:$i]:((((((Z1 @ Z2)))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_18, c_0_19])). 0.55/0.62 thf(c_0_23, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.55/0.62 thf(c_0_24, plain, ((l_some)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((((((![X412:$i]:(((((in @ X412 @ Z0)))=>((((((Z1 @ X412)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_19]), c_0_22])). 0.55/0.62 thf(c_0_25, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])). 0.55/0.62 thf(c_0_26, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_23])). 0.55/0.62 thf(c_0_27, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X450:$i]:(((((in @ X450 @ nat)))=>(((((((((Z0)=(n_pl @ Z1 @ X450))))))=>(~($true))))))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])). 0.55/0.62 thf(c_0_28, axiom, ((n_some)=(^[Z0/* 3 */:$i > $o]:((((((![X439:$i]:(((((in @ X439 @ nat)))=>((((((Z0 @ X439)))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[def_n_some, c_0_24])). 0.55/0.62 thf(c_0_29, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_25, c_0_26])). 0.55/0.62 thf(c_0_30, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((((((![X450:$i]:(((((in @ X450 @ nat)))=>(((((((((Z0)=(n_pl @ Z1 @ X450))))))=>(~($true))))))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_27, c_0_28]), c_0_29])). 0.55/0.62 thf(c_0_31, negated_conjecture, ~(![X676:$i]:(((in @ X676 @ nat)=>~(![X675:$i]:(((in @ X675 @ nat)=>((ordsucc @ X676)!=(n_pl @ X676 @ X675)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz18b])]), c_0_21]), c_0_30])])). 0.55/0.62 thf(c_0_32, plain, ![X618:$i]:(((in @ X618 @ nat)=>((ordsucc @ X618)=(n_pl @ X618 @ n_1)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4e]), c_0_21]), c_0_26])). 0.55/0.62 thf(c_0_33, negated_conjecture, ![X1279:$i]:(((in @ esk53_0 @ nat)&(~(in @ X1279 @ nat)|((ordsucc @ esk53_0)!=(n_pl @ esk53_0 @ X1279))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])). 0.55/0.62 thf(c_0_34, plain, ![X1225:$i]:((~(in @ X1225 @ nat)|((ordsucc @ X1225)=(n_pl @ X1225 @ n_1)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])). 0.55/0.62 thf(c_0_35, negated_conjecture, ![X1:$i]:((~((in @ X1 @ nat))|((ordsucc @ esk53_0)!=(n_pl @ esk53_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_33])). 0.55/0.62 thf(c_0_36, plain, ![X1:$i]:((((ordsucc @ X1)=(n_pl @ X1 @ n_1))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_34])). 0.55/0.62 thf(c_0_37, negated_conjecture, (in @ esk53_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_33])). 0.55/0.62 thf(c_0_38, plain, (in @ n_1 @ nat), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[n_1_p]), c_0_17])). 0.55/0.62 thf(c_0_39, negated_conjecture, ![X1:$i]:((((n_pl @ esk53_0 @ n_1)!=(n_pl @ esk53_0 @ X1))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])])). 0.55/0.62 thf(c_0_40, plain, (in @ n_1 @ nat), inference(split_conjunct,[status(thm)],[c_0_38])). 0.55/0.62 thf(c_0_41, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_39]), c_0_40])]), ['proof']). 0.55/0.62 # SZS output end CNFRefutation 0.55/0.62 # Parsed axioms : 367 0.55/0.62 # Removed by relevancy pruning/SinE : 0 0.55/0.62 # Initial clauses : 535 0.55/0.62 # Removed in clause preprocessing : 158 0.55/0.62 # Initial clauses in saturation : 377 0.55/0.62 # Processed clauses : 94 0.55/0.62 # ...of these trivial : 2 0.55/0.62 # ...subsumed : 9 0.55/0.62 # ...remaining for further processing : 83 0.55/0.62 # Other redundant clauses eliminated : 2 0.55/0.62 # Clauses deleted for lack of memory : 0 0.55/0.62 # Backward-subsumed : 0 0.55/0.62 # Backward-rewritten : 0 0.55/0.62 # Generated clauses : 73 0.55/0.62 # ...of the previous two non-redundant : 61 0.55/0.62 # ...aggressively subsumed : 0 0.55/0.62 # Contextual simplify-reflections : 0 0.55/0.62 # Paramodulations : 57 0.55/0.62 # Factorizations : 0 0.55/0.62 # NegExts : 0 0.55/0.62 # Equation resolutions : 6 0.55/0.62 # Total rewrite steps : 7 0.55/0.62 # Propositional unsat checks : 0 0.55/0.62 # Propositional check models : 0 0.55/0.62 # Propositional check unsatisfiable : 0 0.55/0.62 # Propositional clauses : 0 0.55/0.62 # Propositional clauses after purity: 0 0.55/0.62 # Propositional unsat core size : 0 0.55/0.62 # Propositional preprocessing time : 0.000 0.55/0.62 # Propositional encoding time : 0.000 0.55/0.62 # Propositional solver time : 0.000 0.55/0.62 # Success case prop preproc time : 0.000 0.55/0.62 # Success case prop encoding time : 0.000 0.55/0.62 # Success case prop solver time : 0.000 0.55/0.62 # Current number of processed clauses : 83 0.55/0.62 # Positive orientable unit clauses : 39 0.55/0.62 # Positive unorientable unit clauses: 0 0.55/0.62 # Negative unit clauses : 5 0.55/0.62 # Non-unit-clauses : 39 0.55/0.62 # Current number of unprocessed clauses: 344 0.55/0.62 # ...number of literals in the above : 1230 0.55/0.62 # Current number of archived formulas : 0 0.55/0.62 # Current number of archived clauses : 0 0.55/0.62 # Clause-clause subsumption calls (NU) : 335 0.55/0.62 # Rec. Clause-clause subsumption calls : 301 0.55/0.62 # Non-unit clause-clause subsumptions : 5 0.55/0.62 # Unit Clause-clause subsumption calls : 164 0.55/0.62 # Rewrite failures with RHS unbound : 0 0.55/0.62 # BW rewrite match attempts : 3 0.55/0.62 # BW rewrite match successes : 0 0.55/0.62 # Condensation attempts : 94 0.55/0.62 # Condensation successes : 0 0.55/0.62 # Termbank termtop insertions : 55044 0.55/0.62 0.55/0.62 # ------------------------------------------------- 0.55/0.62 # User time : 0.054 s 0.55/0.62 # System time : 0.013 s 0.55/0.62 # Total time : 0.066 s 0.55/0.62 # Maximum resident set size: 6420 pages 0.55/0.63 0.55/0.63 # ------------------------------------------------- 0.55/0.63 # User time : 0.076 s 0.55/0.63 # System time : 0.024 s 0.55/0.63 # Total time : 0.099 s 0.55/0.63 # Maximum resident set size: 2280 pages 0.83/0.63 % E---3.1 exiting 0.83/0.63 EOF